On Euclidean t-designs
نویسنده
چکیده
A Euclidean t-design, as introduced by Neumaier and Seidel (1988), is a finite set X ⊂ Rn with a weight function w : X → R+ for which
منابع مشابه
On the strong non-rigidity of certain tight Euclidean designs
We study the non-rigidity of Euclidean t-designs, namely we study when Euclidean designs (in particular certain tight Euclidean designs) can be deformed keeping the property of being Euclidean t-designs. We show that certain tight Euclidean t-designs are non-rigid, and in fact satisfy a stronger form of non-rigidity which we call strong non-rigidity. This shows that there are plenty of non-isom...
متن کامل1 3 M ay 2 00 9 Euclidean designs and coherent configurations
The concept of spherical t-design, which is a finite subset of the unit sphere, was introduced by Delsarte-Goethals-Seidel (1977). The concept of Euclidean tdesign, which is a two step generalization of spherical design in the sense that it is a finite weighted subset of Euclidean space, by Neumaier-Seidel (1988). We first review these two concepts, as well as the concept of tight t-design, i.e...
متن کاملOn antipodal Euclidean tight ( 2 e + 1 ) - designs
Neumaier and Seidel (1988) generalized the concept of spherical designs and defined Euclidean designs in Rn . For an integer t , a finite subset X of Rn given together with a weight function w is a Euclidean t-design if ∑p i=1 w(Xi ) |Si | ∫ Si f (x)dσi (x) = ∑ x∈X w(x) f (x) holds for any polynomial f (x) of deg( f ) ≤ t , where {Si , 1 ≤ i ≤ p} is the set of all the concentric spheres centere...
متن کاملOn Euclidean Designs and Potential Energy
We study Euclidean designs from the viewpoint of the potential energy. For a nite set in Euclidean space, we formulate a linear programming bound for the potential energy by applying harmonic analysis on a sphere. We also introduce the concept of strong Euclidean designs from the viewpoint of the linear programming bound, and we give a Fisher type inequality for strong Euclidean designs. A nite...
متن کاملAlgebraic Combinatorics: Spectral Graph Theory, Erdös-Ko-Rado Theorems and Quantum Information Theory
László Babai Symmetry versus regularity Abstract: Symmetry is usually defined in terms of automorphisms; regularity in terms of numerical parameters. Symmetry conditions imply various regularity constraints, but not conversely. We shall discuss two areas of this relationship. First we review some old results by Peter Frankl on how symmetry and regularity constraints affect extremal set systems....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2015